package com.lyj.sc.dynamicProgramming;

/**
 * @Author: liyangjing
 * @Date: 2022/06/28/22:18
 * @Description:
 */
public class zhengshuchaifen {
    public static int integerBreak(int n) {
        // n>2
        int []dp = new int[n+1];
        dp[2]=1;
        for(int i=3;i<=n;i++){
            for(int j=1;j<=i-j;j++){
                dp[i]=Math.max(dp[i],Math.max(j*(i-j),j*dp[i-j]));
                System.out.println(j+"  "+dp[i]);
            }
        }
        return dp[n];
    }

    public static void main(String[] args) {
        Long id = 5L;
        if(id==5){
            id=2L;
        }
        System.out.println(id);
    }
}
